Workshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005) Workshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005)
نویسندگان
چکیده
This paper introduces a method for formal and symbolic analysis of single–input single–output continuous–time control systems. The method is based on traditional control engineering analysis using Nichols plots and thus focuses on the properties of gain (amplitude) and phase–shift. We reduce Nichols plot requirements to a decision problem and present a procedure to decide problems of this type. An implementation of this procedure requires efficient symbolic manipulation and validated numerical calculation. A prototype tool has been developed using the computer algebra system Maple, the formal theorem prover PVS and the QEPCAD tool for quantifier elimination.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملMechanical Software Verification: High Level Control Aspects from a User's Perspective
Strategies are almost ubiquitous in automated deduction and reasoning systems, yet only recently have they been studied in their own right. The workshop aims at making progress towards a deeper understanding of the nature of strategies and search plans, their description, properties, and usage, especially, but not exclusively, in theorem proving and model building. It provides a common forum fo...
متن کاملProceedings of the FLoC ' 99 Workshop on Strategies in AutomatedDeduction ( STRATEGIES ' 99 )
Preface Strategies are almost ubiquitous in automated deduction and reasoning systems, yet only recently have they been studied in their own right. The workshop aims at making progress towards a deeper understanding of the nature of theorem proving strategies, their descriptions , their properties, and their usage. It provides a common forum for researchers working on all aspects of strategies,...
متن کاملA Case-Study in Component-Based Mechanical Verification of Fault-Tolerant Programs1 To appear in Fourth Workshop on Self-Stabilization (WSS’99) Austin, Texas, USA
In this paper, we present a case study to demonstrate that the decomposition of a fault-tolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra’s token ring program in a component-based manner. We also demonstrate the advantages of component based mechanical verification.
متن کاملProceedings of the 4 th International Workshop on Strategies in Automated Deduction ( STRATEGIES 2001 ) held in conjunction with IJCAR 2001
We present lessons learned from using mechanical theorem proving for proof support in software verification, with trusted execution of programs in mind. We will use two realistic running examples, compiler verification, which is central if we want to prove that we can trust a piece of executable software, and an industrial project in which we proved the correctness of a safety critical expert s...
متن کامل